On the generalized principal ideal theorem of complex multiplication
نویسندگان
چکیده
منابع مشابه
On the generalized principal ideal theorem of complex multiplication
In the p-th cyclotomic field Qpn , p a prime number, n ∈ N, the prime p is totally ramified and the only ideal above p is generated by ωn = ζpn − 1, with the primitive p-th root of unity ζpn = e 2πi pn . Moreover these numbers represent a norm coherent set, i.e. NQpn+1/Qpn(ωn+1) = ωn. It is the aim of this article to establish a similar result for the ray class field Kpn of conductor p over an ...
متن کاملGENERALIZED PRINCIPAL IDEAL THEOREM FOR MODULES
The Generalized Principal Ideal Theorem is one of the cornerstones of dimension theory for Noetherian rings. For an R-module M, we identify certain submodules of M that play a role analogous to that of prime ideals in the ring R. Using this definition, we extend the Generalized Principal Ideal Theorem to modules.
متن کاملA Generalized Principal Ideal Theorem
KrulΓs principal ideal theorm [Krull] states that q elements in the maximal ideal of a local noetherian ring generate an ideal whose minimal components are all of height at most q. Writing R for the ring, we may consider the q elements, x19 , xq say, as coordinates of an element xeR. It is an easy observation that every homomorphism R —> R carries x to an element of the ideal generated by xi9 ,...
متن کاملgeneralized principal ideal theorem for modules
the generalized principal ideal theorem is one of the cornerstones of dimension theory for noetherian rings. for an r-module m, we identify certain submodules of m that play a role analogous to that of prime ideals in the ring r. using this definition, we extend the generalized principal ideal theorem to modules.
متن کاملAlgorithms on Ideal over Complex Multiplication order
We show in this paper that the Gentry-Szydlo algorithm for cyclotomic orders, previously revisited by Lenstra-Silverberg, can be extended to complex-multiplication (CM) orders, and even to a more general structure. This algorithm allows to test equality over the polarized ideal class group, and finds a generator of the polarized ideal in polynomial time. Also, the algorithm allows to solve the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2006
ISSN: 1246-7405
DOI: 10.5802/jtnb.566